Ident. | Authors (with country if any) | Title |
---|
000166 |
Guillaume Bonfante [France] ; Reinhard Kahle [France] ; Jean-Yves Marion [France] ; Isabel Oitavem [France] | Two function algebras defining functions in NC k boolean circuits |
000269 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] | Gorille sniffs code similarities, the case study of Qwerty versus Regin |
000285 |
Guillaume Bonfante [France] ; Jose Fernandez [Canada] ; Jean-Yves Marion [France] ; Benjamin Rouxel [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions |
000887 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Thanh Dinh Ta [France] | Malware Message Classification by Dynamic Analysis |
000C10 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Complexity Information Flow in a Multi-threaded Imperative Language |
000E72 |
Jean-Luc Danger [France] ; Mourad Debbabi [Canada] ; Jean-Yves Marion [France] ; Joaquin Garcia-Alfaro [France] ; Nur Zincir Heywood [Canada] | Foundations and practice of security : 6th international symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, revised selected papers |
000F70 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Analysis and Diversion of Duqu's Driver |
001128 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [France] | Evolving graph-structures and their implicit computational complexity |
001188 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Duqu contre Duqu : Analyse et détournement du driver de Duqu |
001271 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Behavior Analysis of Malicious Code by Weighted Behavior Abstraction |
001458 |
Emmanuel Hainry [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | Type-Based Complexity Analysis for Fork Processes |
001586 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [France] | Evolving Graph-Structures and Their Implicit Computational Complexity |
001884 |
Joan Calvet [France] ; José Fernandez [Canada] ; Jean-Yves Marion [France] | Aligot: cryptographic function identification in obfuscated binary programs |
001901 |
Jean-Yves Marion [France] | Les Mac résistent-ils mieux aux virus que les PC ? |
001927 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Code synchronization by morphological analysis |
001955 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Abstraction-based Malware Analysis Using Rewriting and Model Checking |
001C18 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Complexity Information Flow in a Multi-threaded Imperative Language |
001C98 |
Marco Gaboardi [Italie] ; Jean-Yves Marion [France] ; Simona Ronchi Della Rocca [Italie] | An Implicit Characterization of PSPACE |
001D14 |
Jean-Yves Marion [France] | From Turing machines to computer viruses. |
001D84 |
Jean-Yves Marion [France] ; Thomas Schwentick [Allemagne, États-Unis] | Theoretical Aspects of Computer Science |
001F50 |
Jean-Yves Marion [France] | Viruses in Turing's Garden |
002287 |
Jean-Yves Marion [France] | A type system for complexity flow analysis |
002351 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Behavior Analysis of Malware by Rewriting-based Abstraction - Extended Version |
002486 |
Jean-Yves Marion [France] | Informatique et société : Un laboratoire de haute sécurité en informatique : entretien avec Jean-Yves Marion |
002894 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Abstraction by Term Rewriting for Malware Behavior Analysis - Extended Version |
002922 |
Joan Calvet [France] ; Carlton R. Davis [Canada] ; José M. Fernandez [Canada] ; Jean-Yves Marion [France] ; Pier-Luc St-Onge [Canada] ; Wadie Guizani [France] ; Pierre-Marc Bureau [Canada] ; Somayaji Anil [Canada] | The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet |
002979 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Behavior Abstraction in Malware Analysis |
002A53 |
Joan Calvet [France] ; José M. Fernandez [Canada] ; Pierre-Marc Bureau ; Jean-Yves Marion [France] | Large-scale Malware Experiments: Why, How, and So What? |
002B39 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Behavior Abstraction in Malware Analysis - Extended Version |
002B42 |
Joan Calvet [France] ; Carlton Davis [Canada] ; José M. Fernandez [Canada] ; Wadie Guizani [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] ; Pier-Luc St-Onge [Canada] | Isolated virtualised clusters: testbeds for high-risk security experimentation and training |
002C54 |
Wadie Guizani [France] ; Jean-Yves Marion [France] ; Daniel Reynaud [France] | Analyse de Programmes par Traçage |
002E61 |
Olivier Bournez [France] ; Gilles Dowek [France] ; Rémi Gilleron [France] ; Serge Grigorieff [France] ; Jean-Yves Marion [France] ; Simon Perdrix [France] ; Sophie Tison [France] | Décidabilité et Complexité |
002E64 |
Jean-Yves Marion [France] ; Matthieu Kaczmarek [France] | Boulevard du cybercrime |
003039 |
Susanne Albers [Allemagne] ; Jean-Yves Marion [France] | Preface: Special Issue on Theoretical Aspects of Computer Science (STACS) |
003113 |
Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France] | Behavior Abstraction in Malware Analysis |
003318 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Daniel Reynaud [France] | A computability perspective on self-modifying programs |
003322 |
Daniel Reynaud [France] ; Jean-Yves Marion [France] | Dynamic Binary Instrumentation for Deobfuscation and Unpacking |
003360 |
Wadie Guizani [France] ; Jean-Yves Marion [France] ; Daniel Reynaud [France] | Server-Side Dynamic Code Analysis |
003608 |
Philippe Beaucamps [France] ; Jean-Yves Marion [France] | On behavioral detection |
003663 |
Philippe Beaucamps [France] ; Daniel Reynaud-Plantey [France] ; Jean-Yves Marion [France] | On the use of Internet Voting on Compromised Computers |
003699 |
Philippe Beaucamps [France] ; Eric Filiol [France] ; Jean-Yves Marion [France] ; Daniel Reynaud [France] | On the Impact of Malware on Internet Voting |
003744 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Sup-interpretations, a semantic method for static analysis of program resources |
003756 |
Jean-Yves Marion [France] | On tiered small jump operators |
003B88 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Architecture of a morphological malware detector : EICAR 2008 |
003C33 |
Jean-Yves Marion [France] ; Daniel Reynaud [France] | Surfing Code Waves |
003D21 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Analyzing the Implicit Computational Complexity of object-oriented programs |
003E16 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Morphological Detection of Malware |
003F08 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Characterizations of Polynomial Complexity Classes with a Better Intensionality |
004016 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | An implementation of morphological malware detection |
004027 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | A Characterization of NCk by First Order Functional Programs |
004127 |
Marco Gaboardi [Italie] ; Jean-Yves Marion [France] ; Simona Ronchi Della Rocca [Italie] | A Logical Account of PSPACE |
004148 |
Marco Gaboardi [Italie] ; Jean-Yves Marion [France] ; Simona Ronchi Della Rocca [Italie] | Soft Linear Logic and Polynomial Complexity Classes |
004325 |
Guillaume Bonfante [France] ; Reinhard Kahle [Portugal] ; Jean-Yves Marion [France] ; Isabel Oitavem [Portugal] | Recursion Schemata for NC k |
004420 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Architecture of a morphological malware detector |
004437 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | A Characterization of NC k by First Order Functional Programs |
004456 |
Jérome Besombes [France] ; Jean-Yves Marion [France] | LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES |
004465 |
Marco Gaboardi [Italie] ; Simona Ronchi Della Rocca [Italie] ; Jean-Yves Marion [France] | A Logical Account of PSPACE |
004544 |
Daniel Reynaud [France] ; Jean-Yves Marion [France] | Obfuscation by Interpretation |
004703 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Control Flow to Detect Malware |
004731 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs |
004805 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Resource control of object-oriented programs |
004859 |
Jean-Yves Marion [France] | Predicative Analysis of Feasibility and Diagonalization |
004941 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Control Flow Graphs as Malware Signatures |
004961 |
Eric Filiol ; Jean-Yves Marion [France] | La virologie informatique - les virus, ennemis utiles |
004B93 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | Quasi-interpretation Synthesis by Decomposition |
004B99 |
Jean-Yves Marion [France] | Predicative Analysis of Feasibility and Diagonalization |
004C08 |
Anne Bonfante [France] ; Jean-Yves Marion [France] | On the defence notion |
004C38 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning discrete categorial grammars from structures |
004C60 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] | Foreword |
004D32 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | A Classification of Viruses Through Recursion Theorems |
004D50 |
Jérome Besombes [France] ; Jean-Yves Marion [France] | Learning tree languages from positive examples and membership queries |
004E97 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | A characterization of polynomial complexity classes using dependency pairs |
004F44 |
Romain Péchoux [France] ; Jean-Yves Marion [France] ; Guillaume Bonfante [France] | A characterization of Alternating log time by first order functional programs |
004F49 |
Jean-Yves Marion [France] ; Anne Bonfante [France] | Les paradoxes de la défense virale : Le cas bradley |
005046 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Quasi-friendly sup-interpretations |
005397 |
Jean-Yves Marion [France] ; Romain Péchoux [France] | Resource Analysis by Sup-interpretation |
005484 |
Pascal Fontaine [France] ; Jean-Yves Marion [France] ; Stephan Merz [France] ; Leonor Prensa Nieto [France] ; Alwen Tiu [France] | Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants |
005557 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | A Characterization of Alternating Log Time by First Order Functional Programs |
005600 |
Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France] | Implicit complexity over an arbitrary structure : Quantifier alternations |
005764 |
Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Heap-size analysis for assembly programs |
005916 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Logical Characterizations of $P_\mathcal{K}$ and $NP_\mathcal{K}$ Over an Arbitrary Structure $K$ |
005931 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Abstract Detection of Computer Viruses |
005988 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] ; Romain Péchoux [France] | Synthesis of Quasi-interpretations |
006205 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and Small Space Bounds |
006478 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
006479 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretation: a way to control ressources |
006618 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures |
006656 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures |
006761 |
Jean-Yves Marion [France] | Editorial : Implicit Computational Complexity (ICC) |
006B76 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning reversible categorial grammars from structures |
006B77 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning Tree Languages from Positive Examples and Membership Queries |
006E37 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Apprentissage des grammaires catégorielles à partir de structures |
006F01 |
Jean-Yves Marion [France] | Resource Analysis by Quasi-Interpretations |
006F39 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On complexity analysis by quasi-interpretation |
006F67 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning regular trees with queries |
006F68 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning Tree Languages from Positive Examples and Membership Queries |
006F69 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning Reversible Categorial Grammars from Structures |
006F70 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning Dependency Languages from a Teacher |
006F89 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Implicit Complexity over an Arbitrary Structure: Quantifier Alternations |
007217 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Apprentissage des langages réguliers d'arbres à l'aide d'un expert |
007245 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH |
007276 |
Olivier Bournez [France] ; Felipe Cucker ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time |
007A86 |
Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobé De Naurois [France] ; Jean-Yves Marion [France] | Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time |
007B64 |
Jérome Besombes [France] ; Jean-Yves Marion [France] | Efficient learning of regular tree languages and applications |
007D09 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Apprentissage des langages réguliers d'arbres et applications |
007D40 |
Mohamed El Habib ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Jean-Yves Marion [France] ; Stephan Merz [France] | The QSL platform at LORIA |
007D44 |
Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Termination and resource analysis of assembly programs by Petri nets |
008008 |
Olivier Bournez [France] ; Paulin De Naurois [France] ; Jean-Yves Marion [France] | Safe Recursion and Calculus over an Arbitrary Structure |
008907 |
Serge Grigorieff [France] ; Jean-Yves Marion [France] | Kolmogorov complexity and non-determinism |
008A71 |
Olivier Bournez [France] ; Paulin De Naurois [France] ; Jean-Yves Marion [France] | Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time |
008B17 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Learning regular tree languages with positive samples and queries |
008C69 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Identification reversible dependency tree languages |
009323 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On Lexicographic Termination Ordering with Space Bound Certifications |
009390 |
Jean-Yves Marion [France] | Actual Arithmetic and Feasibility |
009471 |
Jérôme Besombes [France] ; Jean-Yves Marion [France] | Une théorie informative de l'apprentissage |
009611 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On lexicographic termination ordering with space bound certifications |
009694 |
Jean-Yves Marion [France] | Actual arithmetic and feasibility |
009730 |
Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Efficient first order functional program interpreter with time bound certifications |
009753 |
Adam Cichon [France] ; Jean-Yves Marion [France] | The Light Lexicographic path Ordering |
009939 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [France] | Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space |
009D70 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [États-Unis, France] | A characterization of alternating log time by ramified recurrence |
009F94 |
Jean-Yves Marion [France] ; J.-Y. Moyen [France] | Efficient first order functional program interpreter with time bound certifications |
00A288 |
Jean-Yves Marion [France] | A proof theoretic approach to feasible computation |
00A844 |
Jean-Yves Marion [France] | From multiple sequent for additive linear logic to decision procedures for free lattices |
00AC84 |
Jean-Yves Marion [France] | Light Multiset path ordering and Ptime - Two is better than one |
00B635 |
Serge Grigorieff [France] ; Jean-Yves Marion [France] | Kolmogorov complexity and non-determinism |
00B675 |
Guillaume Bonfante [France] ; Adam Cichon ; Jean-Yves Marion ; Hélène Touzet | Complexity classes and rewrite systems with polynomial interpretation |
00B693 |
Jean-Yves Marion [France] | An hierarchy of terminating algorithms with semantic interpretation termination proofs |
00BC23 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [France] | Predicative functional recurrence and poly-space |
00BC62 |
Jean-Yves Marion [France] | Case study: Additive linear logic and lattices |
00C716 |
Daniel Leivant [États-Unis] ; Jean-Yves Marion [France] | Ramified recurrence and computational complexity II: Substitution and poly-space |